Identification of partial disjunction, parity, and threshold functions
نویسندگان
چکیده
منابع مشابه
Identification of Partial Disjunction, Parity, and Threshold Functions
Let F be a class of functions obtained by replacing some inputs of a Boolean function of a xed type with some constants. The problem considered in this paper, which is called attribute e cient learning, is to identify \e ciently" a Boolean function g out of F by asking for the value of g at chosen inputs, where \e ciency" is measured in terms of the number of essential variables. We study the q...
متن کاملOptimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions
Decision trees are a very general computation model. Here the problem is to identify a Boolean function f out of a given set of Boolean functions F by asking for the value of f at adaptively chosen inputs. For classes F consisting of functions which may be obtained from one function g on n inputs by replacing arbitrary n?k inputs by given constants this problem is known as attribute-eecient lea...
متن کاملProperties and Modeling of Partial Conjunction/Disjunction
The partial conjunction/disjunction function (PCD) integrates conjunctive and disjunctive features in a single function. Special cases of this function include the pure conjunction, the pure disjunction, and the arithmetic mean. PCD enables a continuous transition from the pure conjunction to the pure disjunction, using a parameter that specifies a desired level of conjunction (andness) or disj...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
On Threshold Circuits for Parity
On Threshold Circuits for Parity Ramamohan Paturi and Michael E. Saks* Department of Computer Science and Engineering University of California, San Diego; La Jolla, Ca 92093 Motivated by the problem of understanding the limitations of neural networks for representing Boolean functions, we consider sizedepth trade-offs for threshold circuits that compute the parity function. We give an almost op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00154-1